Density gradient based regularization of topology optimization problems
نویسندگان
چکیده
منابع مشابه
Undercut and Overhang Angle Control in Topology Optimization: a Density Gradient based Integral Approach
We present an approach for controlling the undercut and the minimal overhang angle in density based topology optimization, which are useful for reducing support structures in additive manufacturing. We cast both the undercut control and the minimal overhang angle control that are inherently constraints on the boundary shape into a domain integral of Heaviside projected density gradient. Such a ...
متن کاملTopology optimization with implicit functions and regularization
Topology optimization is formulated in terms of the nodal variables that control an implicit function description of the shape. The implicit function is constrained by upper and lower bounds, so that only a band of nodal variables needs to be considered in each step of the optimization. The weak form of the equilibrium equation is expressed as a Heaviside function of the implicit function; the ...
متن کاملApproximation of topology optimization problems using sizing optimization problems
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i List of publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2005
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200510188